On a max–norm bound for the least–squares spline approximant

نویسنده

  • Carl de Boor
چکیده

0. Introduction Let ξ = (ξi) 1 be a partition of the interval [a, b], i.e., a = ξ1, < · · · < ξ`+1 = b , and let S := IPk,ξ := IPk,ξ ∩ C(m−1)[a, b] denote the collection of piecewise polynomial functions of order k (i.e., of degree < k) with (interior) breakpoints ξ2, . . . , ξl and in C(m−1)[a, b], i.e., satisfying m continuity conditions at each of its interior breakpoints. We are interested in PS , the orthogonal projector onto S with respect to the ordinary inner product

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bound on the L , - Norm of L - Approximation by Splines in Terms of a Global Mesh Ratio

Let Lkf denote the least-squares approximation to /S Lj by splines of n+k order k with knot sequence t = (t¡)x ■ In connection with their work on Galerkin's method for solving differential equations, Douglas, Dupont and Wahlbin have shown that the norm Hi-^ll,,, of Lk as a map on L«, can be bounded as follows, Halloo < constkMt, with Aij a global mesh ratio, given by Mx := max A^./min {Af,.|Ai;...

متن کامل

A New Technique for Image Zooming Based on the Moving Least Squares

In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...

متن کامل

Reconstruction and smoothing of polygonal curves

In this paper we propose a method for piecewise linear reconstruction and subsequent smoothing of a point sampled curve. The reconstruction step is based on the meshless parameterization reconstruction algorithm proposed by Floater. The information computed in the reconstruction step is used for a least squares based discrete smoothing method, with behavior comparable to a smoothing spline. We ...

متن کامل

Near-optimal sample complexity for convex tensor completion

We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-$r$, order-$d$, $N \times N \times \cdots \times N$ tensor where $r=O(1)$, the best sampling complexity that was achieved is $O(N^{\frac{d}{2}})$, which is obtained by solving a tensor nuclear-norm minimization problem. However, this bound is significantly larger than the number of fre...

متن کامل

Global least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$

In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1981